Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
نویسندگان
چکیده
We present a strategy to develop in a functional setting cor rect e cient and portable Divide and Conquer DC programs for mas sively parallel architectures Starting from an operational DC program mapping sequences to sequences we apply a set of semantics preserving transformation rules which transform the parallel control structure of DC into a sequential control ow thereby making the implicit data par allelism in a DC scheme explicit In the next phase of our strategy the parallel architecture is fully expressed where architecture dependent higher order functions are introduced Then due to the rising commu nication complexities on particular architectures topology dependent communication patterns are optimized in order to reduce the overall communication costs The advantages of this approach are manifold and are demonstrated with a set of non trivial examples
منابع مشابه
Massive Parallelization of Divide-and-Conquer Algorithms over Powerlists
problem adequate structure powerlists We present transformation rules to parallelize Divide-and-Conquer (DC) algorithms over powerlists. These rules convert the parallel control structure of DC into a sequential control flow, thereby making the implicit massive data parallelism in a DC scheme explicit. The results given here are illustrated by many examples including Fast Fourier Transform and ...
متن کاملUnified Framework for the Parallelization of Divide and Conquer Based Tridiagonal Systems
In this paper we describe a method for the regularization and parallelization of tridiagonal algorithms based on the divide and conquer strategy. The method is based on perfect shuffle and unshuffle permutations which transform the flow of these algorithms into a flow with the same pattern of communications in all the stages (constant geometry). We use a unified parallel architecture defined by...
متن کاملPreliminary Result of Parallel Double Divide and Conquer
This paper shows a concept for parallelization of double Divide and Conquer and its preliminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer a...
متن کاملDampvm/dac Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Dampvm/dac
This paper presents a new object oriented framework DAMPVM/DAC which is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-andconquer (DAC) applications at runtime. The processes are then mapped dynamically to processors taking into account their speeds and even loads by other user processes. The paper presents the programming interface (API) of the framework, ...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کامل